-
Notifications
You must be signed in to change notification settings - Fork 0
/
Year 61 - Lazy Pathways
266 lines (265 loc) · 3.24 KB
/
Year 61 - Lazy Pathways
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
-- 7 Billion Humans (2145) --
-- 61: Lazy Pathways by @commonnickname --
step w
step w
mem1 = nearest datacube
jump a
mem2 = foreachdir w:
mem4 = foreachdir s:
a:
jump b
endfor
endfor
b:
if mem1 == 99 and
mem2 == 99:
pickup c
if mem4 != wall:
write 3
drop
pickup mem2
jump c
mem4 = foreachdir n:
c:
if mem4 == wall or
mem4 == worker:
write 2
drop
step w
step w
step n
jump d
mem4 = foreachdir n:
d:
if mem4 == wall:
step w
step w
pickup nw
step nw
write 2
drop
step w
step w
mem1 = nearest datacube
if mem1 == 2:
step w
step w
else:
step sw
endif
step w
pickup c
write 6
drop
step w
mem1 = set 7
else:
if mem4 == datacube:
step nw
step w
step w
step w
step w
step w
step w
step sw
pickup c
write 6
drop
step w
pickup c
write 7
drop
step se
mem1 = set 7
else:
step sw
pickup c
write 2
drop
step e
pickup c
write 2
drop
step e
step e
step e
pickup c
write 3
drop
step sw
step sw
mem1 = set 4
endif
endif
endfor
else:
write 3
drop
jump e
endif
endfor
else:
write 5
drop
step w
step w
pickup c
write 5
drop
step nw
pickup nw
step nw
jump f
endif
else:
step w
if mem1 == 99 and
mem2 == 1:
jump g
mem4 = foreachdir n:
g:
if mem4 == wall:
step w
step w
step w
step w
step w
step w
step w
step sw
step sw
pickup c
write 7
drop
step sw
pickup c
h:
write 8
drop
pickup n
step n
jump h
else:
step s
mem3 = nearest datacube
step sw
step w
if mem3 == 2:
e:
step w
step w
pickup c
f:
write 3
drop
step s
pickup c
write 4
drop
step sw
pickup c
write 5
drop
step sw
mem1 = set 6
else:
step w
step w
pickup c
write 2
drop
step n
step n
pickup c
write 2
drop
step n
pickup nw
write 3
step nw
drop
step w
pickup c
write 4
drop
step w
mem1 = set 5
endif
endif
endfor
else:
step w
step w
step sw
step sw
step sw
step w
step w
if mem2 == 2:
pickup c
if mem1 == 2:
write 7
else:
write 6
endif
drop
step w
step nw
step n
step ne
step e
pickup c
write 9
drop
pickup n
step n
if mem1 == 99:
write 9
else:
write 8
endif
drop
step w
step w
mem1 = set 8
else:
step w
step w
pickup c
if mem1 == mem2:
if mem1 == 3:
write 9
mem2 = set 10
else:
write 7
mem2 = set 8
endif
else:
write 8
mem2 = set 9
endif
drop
pickup nw
step nw
write mem2
drop
pickup n
step n
write mem2
if mem2 == 8:
mem2 = set 9
endif
drop
pickup n
step n
write mem2
drop
step n
mem1 = set 9
endif
endif
endif
pickup c
write mem1
drop